Classical Logic with n Truth Values as a Symmetric Many-Valued Logic
نویسندگان
چکیده
منابع مشابه
Classical Indeterminacy , Many - Valued Logic
The problem of representing 3-valued supervaluational languages by 2-dimensional product languages is pursued in [3], [8], and [4]. A solution is presented here that attempts to incorporate into such a representation familiar and plausible intuitive principles from traditional many-valued theories. In particular, it is argued in Sections II and III that the concept of classical indeterminacy, w...
متن کاملTruth and knowledge fixpoint semantics for many-valued logic programming
The variety of semantical approaches that have been invented for logic programs for reasoning about inconsistent databases is quite broad. Especially, we are interested in an ontological encapsulation of a many-valued logics with negation, based on bilattices, into a 2-valued logic: this new approach is a minimilistic one based on the concept of the semantic reflection. We define a Model theore...
متن کاملProbabilistic and Truth-Functional Many-Valued Logic Programming
We introduce probabilistic many-valued logic programs in which the implication connective is interpreted as material implication. We show that probabilistic many-valued logic programming is computationally more complex than classical logic programming. More precisely, some deduction problems that are P-complete for classical logic programs are shown to be co-NP-complete for probabilistic many-v...
متن کاملMany-valued hybrid logic
In this paper we define a many-valued semantics for hybrid logic and we give a sound and complete tableau system which is prooftheoretically well-behaved, in particular, it gives rise to a decision procedure for the logic. This shows that many-valued hybrid logics is a natural enterprise and opens up the way for future applications.
متن کاملPropositional dynamic logic with Belnapian truth values
We introduce BPDL, a combination of propositional dynamic logic PDL with the basic four-valued modal logic BK studied by Odintsov and Wansing (‘Modal logics with Belnapian truth values’, J. Appl. Non-Class. Log. 20, 279–301 (2010)). We modify the standard arguments based on canonical models and filtration to suit the four-valued context and prove weak completeness and decidability of BPDL.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Foundations of Science
سال: 2020
ISSN: 1233-1821,1572-8471
DOI: 10.1007/s10699-020-09697-7